Information Theoretic Bounds for Sparse Reconstruction in Random Noise
نویسندگان
چکیده
منابع مشابه
Performance Bounds for Sparse Signal Reconstruction with Multiple Side Information
In the context of compressive sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information (SI). To address this problem, we propose a reconstruction algorithm with multiple SI (RAMSI) that solves a general weighted n-`1 norm minimization. The proposed RAMSI algorithm takes advantage of both CS and th...
متن کاملInformation theoretic bounds for distributed computation
A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate of a given function of all the initial measurements in the network. As the main contribution of this paper, we obtain a lower bound on computation time that must be satisfied by any algorithm used by the nodes to communicate an...
متن کاملComplexity Theoretic Lower Bounds for Sparse Principal Component Detection
In the context of sparse principal component detection, we bring evidence towards the existence of a statistical price to pay for computational efficiency. We measure the performance of a test by the smallest signal strength that it can detect and we propose a computationally efficient method based on semidefinite programming. We also prove that the statistical performance of this test cannot b...
متن کاملNoise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem
Certain sparse signal reconstruction problems have been shown to have unique solutions when the signal is known to have an exact sparse representation. This result is extended to provide bounds on the reconstruction error when the signal has been corrupted by noise, or is not exactly sparse for some other reason. Uniqueness is found to be extremely unstable for a number of common dictionaries.
متن کاملInformation theoretic bounds for data hiding in compressed images
We present an information-theoretic approach to obtain an estimate of the number of bits that can be hidden in still images, or, the capacity of the data-hiding channel. We show how addition of the message signal in a suitable transform domain rather than the spatial domain can signiicantly increase the channel capacity. We compare the capacities achievable with diierent decompositions like DCT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2914116